The role of city geometry in determining the utility of a small urban light rail/tram system

In this work, we show the importance of considering a city's shape, as much as its population density figures, in urban transport planning. We consider in particular cities that are circular (the most common shape) compared to those that are rectangular: For the latter case we show greater utility for a single line light rail/tram system. We introduce the new concepts of Infeasible Regions and Infeasibility Factors, and show how to calculate them numerically and (in some cases) analytically. A particular case study is presented for Galway City.Comment: 22 pages. This version has more details on exact calculation of Infeasibility Factors. Accepted for publication in the Springer Journal "Public Transport

Quantum walks with memory on cycles

We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.Comment: 6 pages, 2 figures, published versio

Quantum walks on two kinds of two-dimensional models

In this paper, we numerically study quantum walks on two kinds of two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of graphs are typical two-dimensional topological graph. We study the crossing property of quantum walks on these two models. Also, we study its dependence on the initial state, size of the model. At the same time, we compare the quantum walk and classical walk on these two models to discuss the difference of quantum walk and classical walk

How Quantum Information can improve Social Welfare

It has been shown elsewhere that quantum resources can allow us to achieve a family of equilibria that can have sometimes a better social welfare, while guaranteeing privacy. We use graph games to propose a way to build non-cooperative games from graph states, and we show how to achieve an unlimited improvement with quantum advice compared to classical advice

Physica A Quantum walks with memory on cycles

h i g h l i g h t s • Model of quantum walks with memory on a cyclic graph. • Analysis of limiting probability distribution. • Comparison of the models with the memoryless case. a r t i c l e i n f o b s t r a c t We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model

Nash Equilibria in certain two-choice multi-player games played on the ladder graph

In this paper, we compute analytically the number of Nash Equilibria (NE) for a two-choice game played on a (circular) ladder graph with 2n players. We consider a set of games with generic payoff parameters, with the only requirement that a NE occurs if the players choose opposite strategies (anti-coordination game). The results show that for both, the ladder and circular ladder, the number of NE grows exponentially with (half) the number of players n, as NNE(2n)∼C(φ)n, where φ=1.618.. is the golden ratio and Ccirc>Cladder. In addition, the value of the scaling factor Cladder depends on the value of the payoff parameters. However, that is no longer true for the circular ladder (3-degree graph), that is, Ccirc is constant, which might suggest that the topology of the graph indeed plays an important role for setting the number of NE.2022-01-1

Nash Equilibria in certain two-choice multi-player games played on the ladder graph

In this article we compute analytically the number of Nash Equilibria (NE) for a two-choice game played on a (circular) ladder graph with $2n$ players. We consider a set of games with generic payoff parameters, with the only requirement that a NE occurs if the players choose opposite strategies (anti-coordination game). The results show that for both, the ladder and circular ladder, the number of NE grows exponentially with (half) the number of players $n$, as $N_{NE}(2n)\sim C(\varphi)^n$, where $\varphi=1.618..$ is the golden ratio and $C_{circ}>C_{ladder}$. In addition, the value of the scaling factor $C_{ladder}$ depends on the value of the payoff parameters. However, that is no longer true for the circular ladder (3-degree graph), that is $C_{circ}$ is constant, which might suggest that the topology of the graph indeed plays an important role for setting the number of NE.Comment: 15 pages, 7 figures. Paper online ready in journal International Game Theory Revie